Driver scheduling problem modelling

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an ...

The Driver Scheduling Problem

The Bus-Driver Scheduling Problem

We present new metaheuristics for solving real crew scheduling problems in a public transportation bus company. Since the crews of these companies are drivers, we will designate the problem by the bus-driver scheduling problem. Crew scheduling problems are well known and several mathematical programming based techniques have been proposed to solve them, in particular using the set-covering form...

A Heuristic Solution for a Driver-Vehicle Scheduling Problem

A driver-vehicle scheduling problem in a limousines rental company is studied. Given a set of trip demands to be covered, the goal is to find a driver-vehicle schedule that covers as many as possible of the required demands while satisfying a set of imperative constraints and optimizing several cost objectives. A formulation of the problem is given and a solution approach using local search is ...

Bus Driver Scheduling Problem using TLBO and JAYA Algorithm

Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly ge...